Maximal Intersecting Families of Finite Sets and «uniform Hjelmslev Planes
نویسنده
چکیده
The following theorem is proved. The collection of lines of an n-uniform projective Hjelmslev plane is maximal when considered as a collectiion of mutually intersecting sets of equal cardinality.
منابع مشابه
On maximal arcs in projective Hjelmslev planes over chain rings of even characteristic
In this paper, we prove that maximal (k, 2)-arcs in projective Hjelmslev planes over chain rings R of nilpotency index 2 exist if and only if charR = 4. © 2005 Elsevier Inc. All rights reserved.
متن کاملIntersecting designs from linear programming and graphs of diameter two
We investigate l-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.
متن کاملIntersecting Families — Uniform versus Weighted
What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.
متن کاملNew arcs in projective Hjelmslev planes over Galois rings
It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting point constellations in certain projective geometries. For example, the expurgated Nordstrom-Robinson code, a nonlinear binary [14, 6, 6]-code which has higher minimum distance than any linear binary [14, 6]-code, can be constructed from a maximal 2-arc in the projective Hjelmslev plane over Z4. W...
متن کاملBounds on sets with few distances
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: • we improve the Ray-Chaudhuri–Wilson bound of the size of uniform intersecting families of subsets; • we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; • we prove a new bound on codes with few dista...
متن کامل